A First-Order Extension of Modal μ- calculus
نویسنده
چکیده
Modal μ-calculus is a modal logic with fixed-point operators and well-known in mathematics and computer scince. For example, many verification properties of a system are expressed by formulas of modal μcalculus in computer science. However some verification properties of a system can not be expressed by a formula of modal μ-calculus as we will show later, and quantifiers of first-order logic are essentially required for expressing the verification properties. Therefore a first-order extension of modal μ-calculus is needed for expressing such verification properties. In this paper we introduce a first-order extension of modal μ-calculus and show that it is Σ 1 -complete. Moreover we express some verification properties of a system by its formulas for showing its usefulness.
منابع مشابه
A linear translation from CTL* to the first-order modal μ -calculus
The modal μ-calculus is a very expressive temporal logic. In particular, logics such as LTL, CTL and CTL* can be translated into the modal μ-calculus, although existing translations of LTL and CTL* are at least exponential in size. We show that an existing simple first-order extension of the modal μ-calculus allows for a linear translation from LTL. Furthermore, we show that solving the transla...
متن کاملA linear translation from LTL to the first-order modal μ-calculus
The modal μ-calculus is a very expressive temporal logic. In particular, logics such as LTL, CTL and CTL* can be translated into the modal μ-calculus, although existing translations of LTL and CTL* are at least exponential in size. We show that an existing simple first-order extension of the modal μ-calculus allows for a linear translation from LTL. Furthermore, we show that solving the transla...
متن کاملModel-checking processes with data
We propose a procedure for automatically verifying properties (expressed in an extension of the modal μ-calculus) over processes with data, specified in μCRL. We first briefly review existing work, such as the theory of μCRL and we discuss the logic, called first order modal μ-calculus in more detail. Then, we introduce the formalism of first order boolean equation systems and focus on several ...
متن کاملCompleteness Theorem of First - Order Modal μ - calculus
We prove that a natural axiom system of first-order modal μ-calculus is complete with respect to “general” models.
متن کاملCompletions of µ-algebras
A μ-algebra is a model of a first order theory that is an extension of the theory of bounded lattices, that comes with pairs of terms (f, μx.f) where μx.f is axiomatized as the least prefixed point of f , whose axioms are equations or equational implications. Standard μ-algebras are complete meaning that their lattice reduct is a complete lattice. We prove that any non trivial quasivariety of μ...
متن کامل